'Weak Dependency Graph [60.0]'
------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ a(x1) -> x1
, a(b(x1)) -> b(b(a(a(c(a(x1))))))
, c(c(a(x1))) -> x1}
Details:
We have computed the following set of weak (innermost) dependency pairs:
{ a^#(x1) -> c_0()
, a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))
, c^#(c(a(x1))) -> c_2()}
The usable rules are:
{ a(x1) -> x1
, a(b(x1)) -> b(b(a(a(c(a(x1))))))
, c(c(a(x1))) -> x1}
The estimated dependency graph contains the following edges:
{a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))}
==> {a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))}
{a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))}
==> {a^#(x1) -> c_0()}
We consider the following path(s):
1) { a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))
, a^#(x1) -> c_0()}
The usable rules for this path are the following:
{ a(x1) -> x1
, a(b(x1)) -> b(b(a(a(c(a(x1))))))
, c(c(a(x1))) -> x1}
We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ a(x1) -> x1
, a(b(x1)) -> b(b(a(a(c(a(x1))))))
, c(c(a(x1))) -> x1
, a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))
, a^#(x1) -> c_0()}
Details:
We apply the weight gap principle, strictly orienting the rules
{ a(x1) -> x1
, c(c(a(x1))) -> x1
, a^#(x1) -> c_0()}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ a(x1) -> x1
, c(c(a(x1))) -> x1
, a^#(x1) -> c_0()}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [1]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0() = [0]
c_1(x1) = [1] x1 + [0]
c^#(x1) = [0] x1 + [0]
c_2() = [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))}
and weakly orienting the rules
{ a(x1) -> x1
, c(c(a(x1))) -> x1
, a^#(x1) -> c_0()}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [1]
b(x1) = [1] x1 + [8]
c(x1) = [1] x1 + [4]
a^#(x1) = [1] x1 + [12]
c_0() = [0]
c_1(x1) = [1] x1 + [0]
c^#(x1) = [0] x1 + [0]
c_2() = [0]
Finally we apply the subprocessor
'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
------------------------------------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {a(b(x1)) -> b(b(a(a(c(a(x1))))))}
Weak Rules:
{ a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))
, a(x1) -> x1
, c(c(a(x1))) -> x1
, a^#(x1) -> c_0()}
Details:
The problem was solved by processor 'Bounds with default enrichment':
'Bounds with default enrichment'
--------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {a(b(x1)) -> b(b(a(a(c(a(x1))))))}
Weak Rules:
{ a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))
, a(x1) -> x1
, c(c(a(x1))) -> x1
, a^#(x1) -> c_0()}
Details:
The problem is Match-bounded by 1.
The enriched problem is compatible with the following automaton:
{ a_0(2) -> 8
, a_0(7) -> 6
, a_1(2) -> 13
, a_1(11) -> 10
, a_1(12) -> 10
, a_1(12) -> 11
, b_0(2) -> 2
, b_0(2) -> 8
, b_0(2) -> 13
, b_1(9) -> 8
, b_1(9) -> 13
, b_1(10) -> 9
, c_0(8) -> 6
, c_0(8) -> 7
, c_1(13) -> 10
, c_1(13) -> 11
, c_1(13) -> 12
, a^#_0(2) -> 4
, a^#_0(6) -> 5
, a^#_1(11) -> 14
, c_0_0() -> 4
, c_0_0() -> 5
, c_0_1() -> 14
, c_1_0(5) -> 4
, c_1_1(14) -> 4}
2) {a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))}
The usable rules for this path are the following:
{ a(x1) -> x1
, a(b(x1)) -> b(b(a(a(c(a(x1))))))
, c(c(a(x1))) -> x1}
We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ a(x1) -> x1
, a(b(x1)) -> b(b(a(a(c(a(x1))))))
, c(c(a(x1))) -> x1
, a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))}
Details:
We apply the weight gap principle, strictly orienting the rules
{ a(x1) -> x1
, c(c(a(x1))) -> x1}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ a(x1) -> x1
, c(c(a(x1))) -> x1}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [1]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0() = [0]
c_1(x1) = [1] x1 + [0]
c^#(x1) = [0] x1 + [0]
c_2() = [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))}
and weakly orienting the rules
{ a(x1) -> x1
, c(c(a(x1))) -> x1}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [1]
b(x1) = [1] x1 + [8]
c(x1) = [1] x1 + [4]
a^#(x1) = [1] x1 + [12]
c_0() = [0]
c_1(x1) = [1] x1 + [0]
c^#(x1) = [0] x1 + [0]
c_2() = [0]
Finally we apply the subprocessor
'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
------------------------------------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {a(b(x1)) -> b(b(a(a(c(a(x1))))))}
Weak Rules:
{ a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))
, a(x1) -> x1
, c(c(a(x1))) -> x1}
Details:
The problem was solved by processor 'Bounds with default enrichment':
'Bounds with default enrichment'
--------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {a(b(x1)) -> b(b(a(a(c(a(x1))))))}
Weak Rules:
{ a^#(b(x1)) -> c_1(a^#(a(c(a(x1)))))
, a(x1) -> x1
, c(c(a(x1))) -> x1}
Details:
The problem is Match-bounded by 1.
The enriched problem is compatible with the following automaton:
{ a_0(2) -> 8
, a_0(7) -> 6
, a_1(2) -> 13
, a_1(11) -> 10
, a_1(12) -> 10
, a_1(12) -> 11
, b_0(2) -> 2
, b_0(2) -> 8
, b_0(2) -> 13
, b_1(9) -> 8
, b_1(9) -> 13
, b_1(10) -> 9
, c_0(8) -> 6
, c_0(8) -> 7
, c_1(13) -> 10
, c_1(13) -> 11
, c_1(13) -> 12
, a^#_0(2) -> 4
, a^#_0(6) -> 5
, a^#_1(11) -> 14
, c_1_0(5) -> 4
, c_1_1(14) -> 4}
3) {c^#(c(a(x1))) -> c_2()}
The usable rules for this path are empty.
We have oriented the usable rules with the following strongly linear interpretation:
Interpretation Functions:
a(x1) = [0] x1 + [0]
b(x1) = [0] x1 + [0]
c(x1) = [0] x1 + [0]
a^#(x1) = [0] x1 + [0]
c_0() = [0]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [0] x1 + [0]
c_2() = [0]
We have applied the subprocessor on the resulting DP-problem:
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost DP runtime-complexity with respect to
Strict Rules: {c^#(c(a(x1))) -> c_2()}
Weak Rules: {}
Details:
We apply the weight gap principle, strictly orienting the rules
{c^#(c(a(x1))) -> c_2()}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{c^#(c(a(x1))) -> c_2()}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [0] x1 + [0]
c(x1) = [1] x1 + [0]
a^#(x1) = [0] x1 + [0]
c_0() = [0]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [1]
c_2() = [0]
Finally we apply the subprocessor
'Empty TRS'
-----------
Answer: YES(?,O(1))
Input Problem: innermost DP runtime-complexity with respect to
Strict Rules: {}
Weak Rules: {c^#(c(a(x1))) -> c_2()}
Details:
The given problem does not contain any strict rules